Btrct Resource-bound Classes
نویسنده
چکیده
RESOURCE:-BOUND CLASSES ABSTRACT RESOURÈE BOUND CLASSESRESOURÈE BOUND CLASSES ACADEMISCH PROEFSCHRIFT TER VERKRIJGING VAN DE GRAAD VAN DOCTOR IN DE WISK2NDE EN NATUURWETENSCHAPPEN AAN DE UNIVERSITEIT VAN AMTERDAM OP GEZAG VAN DE RECTOR MAGNIFICUS DR. A. DE FROE HOOGLERAAR IN DE FACULTEIT DER GENEESKUNDE IN HET OPENBAAR TE VERDEDIGEN IN DE AULA DER UNIVERSITEIT (TIJDELIJK IN DE LUTHERSE KERK, INGANG SINGEL 411, HOEK SPUI) OP WOENSDAG 18 SEPTEMBER 1974 DES NAMIDDAGS TE 1.30 UUR
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملMeasuring in PSPACE
Results of the kind \Almost every oracle in exponential space separates P from NP" or \Almost every set in exponential time is P-bi-immune" can be precisely formulated via a new approach in Structural Complexity recently introduced by Lutz. He deenes a resource-bounded measure in exponential time and space classes that generalizes Lebesgue measure, a powerful mathematical tool. We investigate h...
متن کاملProject Scheduling with Modular Project Completion on a Bottleneck Resource
In this paper, we model a research-and-development project as consisting of several modules, with each module containing one or more activities. We examine how to schedule the activities of such a project in order to maximize the expected profit when the activities have a probability of failure and when an activity’s failure can cause its module and thereby the overall project to fail. A module...
متن کاملLocal Probing for Resource
This paper investigates a form of algorithm hybridization that combines constraint satisfaction algorithms with local search algorithms. On one hand, constraint satisfaction algorithms are eeective at nding feasible solutions for tightly constrained problems with complex constraints. On the other hand, local search algorithms are usually better at nding solutions that are good with respect to a...
متن کاملResource-bounded Dimension in Computational Learning Theory
This paper focuses on the relation between computational learning theory and resource-bounded dimension. We intend to establish close connections between the learnability/nonlearnability of a concept class and its corresponding size in terms of effective dimension, which will allow the use of powerful dimension techniques in computational learning and viceversa, the import of learning results i...
متن کامل